منابع مشابه
Monocytes Join the Dendritic Cell Family
Dendritic cells are professional antigen-presenting cells that mediate immunity and tolerance. Cheong et al. (2010) uncover a new route for dendritic cell production in vivo. They show that in response to infection by gram-negative bacteria, monocytes are recruited to the lymph node where they rapidly differentiate into dendritic cells that present antigens to T cells.
متن کاملDesigning and presenting a model to assess the readiness of the Iranian Customs Organization to join the Fourth Industrial Revolution
So far, there have been three major technological advances. The first industrial revolution in Britain began and hydraulic and steam machines were introduced to factories. The Second Industrial Revolution differentiated between components and assembly of products based on the division of labor. This led people to the era of cost-effective products and mass production. The Third Industrial Revol...
متن کاملCullin-based ubiquitin ligases: Cul3-BTB complexes join the family.
Cullin-based E3 ligases target substrates for ubiquitin-dependent degradation by the 26S proteasome. The SCF (Skp1-Cul1-F-box) and ECS (ElonginC-Cul2-SOCS box) complexes are so far the best-characterized cullin-based ligases. Their atomic structure has been solved recently, and several substrates have been described in different organisms. In addition to Cul1 and Cul2, higher eucaryotic genomes...
متن کاملOn the planarity of a graph related to the join of subgroups of a finite group
Let $G$ be a finite group which is not a cyclic $p$-group, $p$ a prime number. We define an undirected simple graph $Delta(G)$ whose vertices are the proper subgroups of $G$, which are not contained in the Frattini subgroup of $G$ and two vertices $H$ and $K$ are joined by an edge if and only if $G=langle H , Krangle$. In this paper we classify finite groups with planar graph. ...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Marketing Quarterly
سال: 2014
ISSN: 1524-5004,1539-4093
DOI: 10.1177/1524500414545564